Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
نویسندگان
چکیده
منابع مشابه
Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable
The deficiency of a propositional formula F in CNF with n variables and m clauses is defined as m−n. It is known that minimal unsatisfiable formulas (unsatisfiable formulas which become satisfiable by removing any clause) have positive deficiency. Recognition of minimal unsatisfiable formulas is NP-hard, and it was shown recently that minimal unsatisfiable formulas with deficiency k can be reco...
متن کاملPolynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. Let F(k) be the class of formulas such that the number of clauses exceeds the number of variables exactly by k. Every minimal unsatisfiable formula belongs to F(k) for some k ≥ 1. Polynomial–time algorithms are known to recognize minimal unsatisfiable f...
متن کاملOn subclasses of minimal unsatisfiable formulas
We consider the minimal unsatissablity problem MU(k) for proposi-tional formulas in conjunctive normal form (CNF) over n variables and n + k clauses, where k is xed. It will be shown that MU(k) is in NP. Based on the non{deterministic algorithm we prove for MU(2) that after a simpliication by resolving over variables occuring at most once positively or at most once negatively such minimal unsat...
متن کاملOn the Size of Minimal Unsatisfiable Formulas
An unsatisfiable formula is called minimal if it becomes satisfiable whenever any of its clauses are removed. We construct minimal unsatisfiable k-SAT formulas with Ω(nk) clauses for k ≥ 3, thereby negatively answering a question of Rosenfeld. This should be compared to the result of Lovász [Studia Scientiarum Mathematicarum Hungarica 11, 1974, p113-114] which asserts that a critically 3-chroma...
متن کاملProbabilistic Models over Weighted Orderings: Fixed-Parameter Tractable Variable Elimination
Probabilistic models with weighted formulas, known as Markov models or log-linear models, are used in many domains. Recent models of weighted orderings between elements that have been proposed as flexible tools to express preferences under uncertainty, are also potentially useful in applications like planning, temporal reasoning, and user modeling. Their computational properties are very differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2004
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.04.009